On minimum sum representations for weighted voting games
نویسندگان
چکیده
منابع مشابه
On minimum sum representations for weighted voting games
A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the “yea” voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum, where the weights and the quota are restricted to be integers. In [Freixas and Molinero(2009)] the authors have classified all weighted voting games without ...
متن کاملOn minimum integer representations of weighted games
We study minimum integer representations for the weights of weighted games, which is linked with some solution concepts in game theory. Closing some gaps in the existing literature we prove that each weighted game with two types of voters admits a unique minimum integer presentation and give examples for more than two types of voters without a minimum integer representation. We characterize the...
متن کاملDynamic weighted voting games
We initiate the study of dynamic cooperative games—cooperative games where the characteristic function may change over time. We introduce two types of algorithmic problems for such games: computing a given solution concept at time t, and checking that a certain function of the game (e.g., the Shapley value of a given player or the value of the least core) remains within given bounds during time...
متن کاملReliability Weighted Voting Games
We examine agent failures in weighted voting games. In our cooperative game model, R-WVG, each agent has a weight and a survival probability, and the value of an agent coalition is the probability that its surviving members would have a total weight exceeding a threshold. We propose algorithms for computing the value of a coalition, finding stable payoff allocations, and estimating the power of...
متن کاملEnumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2012
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-012-1108-3